package com.tgy.树.二叉树.二叉排序树;

import java.util.ArrayList;

/***
 * @ClassName: Test
 * @Description:
 * @Auther: tanggy3
 * @Date: 15:59 2023/3/21
 * @version : V1.0
 */
public class Test {
    public static void main(String[] args) {
        int a = 0;
        while (a < 5) {
            switch (a) {
                case 0:
                case 3:
                    a = a + 2;
                case 1:
                case 2:
                    a = a + 3;
                default:
                    a = a + 15;
            }
        }
        System.out.println(a);
        int i = 0, s = 0;
        do {
            if (i % 2 == 0) {
                i++;
                continue;
            }
            i++;
            s = s + i;
        } while ((i < 7));
        System.out.println(s);
        //Test test = new Test();
        ArrayList<Object> al = new ArrayList<>();
        al.add(1);
        print(al);
        System.out.println(al.get(1));
    }
    static void print(ArrayList al){
        al.add(2);
        al = new ArrayList();
        al.add(3);
        al.add(4);
    }

    public Test() {

    }
}

